Pii: S0377-0427(02)00563-0
نویسندگان
چکیده
The prior estimate and decay property of positive solutions are derived for a system of quasilinear elliptic 9 di$erential equations 3rst. Then, the nonexistence result for radially nonincreasing positive solutions of the system is implied. By using this nonexistence result, blow-up estimates for a class of quasilinear reaction–di$usion 11 systems (non-Newtonian 3ltration systems) are established to extend the result for semilinear reaction–di$usion systems (Fujita type). 13 c © 2002 Published by Elsevier Science B.V. MSC: 35J05; 35J65; 35K05; 35K60 15
منابع مشابه
Pii: S0377-0427(98)00172-1
We discuss some aspects of discrete-time birth-death processes or random walks, highlighting the role played by orthogonal polynomials. (~) 1998 Elsevier Science B.V. All rights reserved. AMS classification: Primary 60 J 80, secondary 42 C 05, 60 J 10
متن کاملData Envelopment Analysis, A comprehensive text with models, applications, references and DEA-solver software, W.W. Cooper, L.M. Seiford and K. Tone; Kluwer, 1999, ISBN 0-7923-8693-0, 318 pages
Contents List of Tables xv List of Figures xvii Preface xix 1.
متن کاملOn the nucleolus of neighbor games
Assignment problems are well-known problems in practice. We mention house markets, job markets, and production planning. The games of interest in this paper, the neighbor games, arise from a special class of assignment problems. We focus on the nucleolus [D. Schmeidler, SIAM J. Appl. Math. 17 (1969) 1163–1170], one of the most prominent core solutions. A core solution is interesting with respec...
متن کاملAn MCDM approach to portfolio optimization
We propose a model for portfolio optimization extending the Markowitz mean–variance model. Based on cooperation with Standard and Poor s we use five specific objectives related to risk and return and allow consideration of individual preferences through the construction of decision-maker specific utility functions and an additive global utility function. Numerical results using customized local...
متن کاملInapproximability and a polynomially solvable special case of a network improvement problem
We consider a network improvement problem in which we wish to spend as little as possible to ensure that the distances from a given vertex to all other vertices are within given bounds. We first prove that achieving an approximation ratio ð1þ Þ is NP-hard for some constant > 0. Then we show that the problem can be solved by a combinatorial algorithm running in OðjV j log jV jÞ time when the net...
متن کامل